Weak Arithmetic Equivalence
نویسندگان
چکیده
منابع مشابه
Intuitionistic weak arithmetic
We construct ω-framed Kripke models of i∀1 and iΠ1 non of whose worlds satisfies ∀x∃y(x = 2y∨x = 2y+1) and ∀x, y∃zExp(x, y, z) respectively. This will enable us to show that i∀1 does not prove ¬¬∀x∃y(x = 2y ∨ x = 2y + 1) and iΠ1 does not prove ¬¬∀x, y∃zExp(x, y, z). Therefore, i∀1 0 ¬¬lop and iΠ1 0 ¬¬iΣ1. We also prove that HA 0 lΣ1 and present some remarks about iΠ2. 2000 Mathematics Subject C...
متن کاملCardinal Arithmetic in Weak Theories
In this paper we develop the theory of cardinals in the theory COPY. This is the theory of two total, jointly injective binary predicates in a second order version, where we may quantify over binary relations. The only second order axioms of the theory are the axiom asserting the existence of an empty relation and the adjunction axiom, which says that we may enrich any relation R with a pair x,...
متن کاملMartin’s Conjecture, Arithmetic Equivalence, and Countable Borel Equivalence Relations
There is a fascinating interplay and overlap between recursion theory and descriptive set theory. A particularly beautiful source of such interaction has been Martin’s conjecture on Turing invariant functions. This longstanding open problem in recursion theory has connected to many problems in descriptive set theory, particularly in the theory of countable Borel equivalence relations. In this p...
متن کاملWeak Equivalence in Propositional Calculus
The main purpose of this paper is to present a new algorithm (NEWSAT) for deciding the (un)satisfiability of propositional formulae. It is based on a somehow dual (versus resolution) idea: we succesively add complementary literals to already obtained clauses instead of solving them. Hence, the unsatisfiability of a formula is detected by reaching “a complete set of maximal clauses” instead of r...
متن کاملWeak Equivalence for Constraint Sets
We describe a generalization of equivalence between constraint sets, called weak equivalence. This new equivalence relation takes into account that not all variables have the same function in a constraint set and therefore distinguishes between restriction variables and intermediate variables. We explore the properties of weak equivalence and its underlying notion of weak implication with an ax...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Canadian Mathematical Bulletin
سال: 2015
ISSN: 0008-4395,1496-4287
DOI: 10.4153/cmb-2014-036-7